#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <math.h>
#include <cstring>
#include <queue>
using namespace std;
const int N = 1020;
int A[110][110], B[110][110], res[110][110];
int main()
{
	int n, m, k;
	scanf("%d%d%d", &n, &m, &k);
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			scanf("%d", &A[i][j]);
		}
	}
	for (int i = 1; i <= m; i++)
	{
		for (int j = 1; j <= k; j++)
		{
			scanf("%d", &B[i][j]);
		}
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= k; j++)
		{
			int sum = 0;
			for (int t = 1; t <= m; t++)//maybe t == together ? haha
			{
				sum += A[i][t] * B[t][j];
			}
			printf("%d ", sum);
		}
		printf("\n");
	}
	return 0;
}